Reasoning about Minimal Knowledge in Nonmonotonic Modal Logics

نویسنده

  • Riccardo Rosati
چکیده

We study the problem of embedding Halpern and Moses’s modal logic of minimal knowledge states into two families of modal formalism for nonmonotonic reasoning, McDermott and Doyle’s nonmonotonic modal logics and ground nonmonotonic modal logics. First, we prove that Halpern and Moses’s logic can be embedded into all ground logics; moreover, the translation employed allows for establishing a lower bound (5p3 ) for the problem of skeptical reasoning in all ground logics. Then, we show a translation of Halpern and Moses’s logic into a significant subset of McDermott and Doyle’s formalisms. Such a translation both indicates the ability of Halpern and Moses’s logic of expressing minimal knowledge states in a more compact way than McDermott and Doyle’s logics, and allows for a comparison of the epistemological properties of such nonmonotonic modal formalisms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Knowledge States in Nonmonotonic Modal Logics

Recent studies on the computational properties of the logic of minimal knowledge states due to Halpern and Moses (also known as ground logic S5 G) have shown that reasoning in this logic is strictly harder than in all the most studied propositional non-monotonic formalisms, in particular with respect to nonmonotonic modal logics due to McDermott and Doyle. In this paper we show that the logic o...

متن کامل

Towards First-Order Nonmonotonic Reasoning

We investigate the problem of reasoning in nonmonotonic extensions of rst-order logic. In particular, we study reasoning in rst-order MKNF, the modal logic of minimal knowledge and negation as failure introduced by Lifschitz. MKNF can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, and logic programming. B...

متن کامل

Epistemic Extension of Propositional Preference Logics

Most of the current nonmono-tonic logics are limited to a propositional or a first-order language. This means that these formalisms cannot model an agent reasoning about the knowledge of other nonmono-tonic agents, which limits the usefulness of such formalisms in modeling communication among agents. This paper follows the approach that one can extend some of the existing nonmonotonic logics to...

متن کامل

Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking

To support nonmonotonic reasoning we introduce the description logic of minimal knowledge and negation as failure (MKNF-DL) as an extension of description logic with modal operators K and A. We discuss the problems with representation of a model for an MKNF-DL theory. For satisfiability checking of MKNF-DL theories, we introduce a tableaux algorithm with blocking, where blocking works with the ...

متن کامل

Ground Nonmonotonic Modal Logics

In this paper we address ground logics, a family of nonmonotonic modal logics, and their usage in knowledge representation. In such a setting non-modal sentences are used to represent the knowledge of an agent about the world, while an epistemic operator provides the agent with autoepistemic or introspective knowledge. Ground logics are based on the idea of characterizing the knowledge of the a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Logic, Language and Information

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1999